Перевод: с русского на все языки

со всех языков на русский

conjunctive clause

См. также в других словарях:

  • conjunctive mood — noun (grammar) The subjunctive mood generally, or when used in a principal clause, or in the principal clause of a conditional sentence • • • Main Entry: ↑conjunct …   Useful english dictionary

  • Conjunctive adverb — A conjunctive adverb is an adverb that connects two clauses. Conjunctive adverbs show cause and effect, sequence, contrast, comparison, or other relationships. Contents 1 Common conjunctive adverbs 2 Punctuation 3 Examples 4 …   Wikipedia

  • Conjunctive normal form — In Boolean logic, a formula is in conjunctive normal form (CNF) if it is a conjunction of clauses, where a clause is a disjunction of literals. As a normal form, it is useful in automated theorem proving. It is similar to the product of sums form …   Wikipedia

  • Clause (logic) — For other uses, see Clause (disambiguation). In logic, a clause is a finite disjunction of literals.[1] Clauses are usually written as follows, where the symbols li are literals: In some cases, clauses are written (or defined) as sets of literals …   Wikipedia

  • conjunctive legacy — noun : a legacy awarding under Roman law the same thing to two or more persons in one dispositive clause and giving each colegatee the right of increasing his share proportionately to his interest if the share of any other colegatee lapses or… …   Useful english dictionary

  • Relative clause — A relative clause is a subordinate clause that modifies a noun. For example, the noun phrase the man who wasn t there contains the noun man , which is modified by the relative clause who wasn t there . In many languages, relative clauses are… …   Wikipedia

  • Horn clause — In mathematical logic, a Horn clause is a clause (a disjunction of literals) with at most one positive literal. They are named after the logician Alfred Horn, who first pointed out the significance of such clauses in 1951. Horn clauses play a… …   Wikipedia

  • 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

  • Resolution (logic) — In mathematical logic and automated theorem proving, resolution is a rule of inference leading to a refutation theorem proving technique for sentences in propositional logic and first order logic. In other words, iteratively applying the… …   Wikipedia

  • Subjunctive mood — In grammar, the subjunctive mood (abbreviated sjv or sbjv) is a verb mood typically used in subordinate clauses to express various states of irreality such as wish, emotion, possibility, judgment, opinion, necessity, or action that has not yet… …   Wikipedia

  • Coptic language — Coptic ⲘⲉⲧⲢⲉⲙ̀ⲛⲭⲏⲙⲓ, Μετ Ρεμνχημι Mad.Rmenkami Spoken in Egypt, Canada, Australia, United States …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»